Mining mutation chains in biological sequences.

An Indexing Scheme for Fast and Accurate Chemical Fingerprint Database Searching.

SLiM on Diet finding short linear motifs on domain interaction interfaces in Protein Data Bank.

Searching for Rising Stars in Bibliography Networks.

Efficient and Anonymous Online Data Collection.

MACs Multi%2DAttribute Co%2Dclusters with High Correlation Information.

An Interval type%2D2 Neural Fuzzy Inference System based on Piaget%27s action%2Dcognitive paradigm.

Positive Unlabeled Learning for Data Stream Classification.

Collusion%2Dresistant anonymous data collection method.

Positive Unlabeled Learning for Data Stream Classification.



Privacy%2Dpreserving e%2Dpayments using one%2Dtime payment details.

MDPD an integrated genetic information resource for Parkinson%27s disease.

Enabling Privacy%2DPreserving e%2DPayment Processing.

A Unified Scoring Scheme for Detecting Essential Proteins in Protein Interaction Networks.

TNFIS Tree%2Dbased neural fuzzy inference system.

Inferring Transcription Factor interactions using a novel HV%2DSVM classifier.

Ppiclust Efficient Clustering of 3D protein%2Dprotein Interaction Interfaces.
The biological mechanisms through which proteins interact with one another are best revealed by studying the structural interfaces between interacting proteins. Protein– protein interfaces can be extracted from three-dimensional (3D) structural data of protein complexes and then clustered to derive biological insights. However, conventional protein interface clustering methods lack computational scalability and statistical support. In this work, we present a new method named “PPiClust ” to systematically encode, cluster, and analyze similar 3D interface patterns in protein complexes efficiently. Experimental results showed that our method is effective in discovering visually consistent and statistically significant clusters of interfaces, and at the same time sufficiently timeefficient to be performed on a single computer. The interface clusters are also useful for uncovering the structural basis of protein interactions. Analysis of the resulting interface clusters revealed groups of structurally diverse proteins having similar interface patterns. We also found, in some of the interface clusters, the presence of well-known linear binding motifs which were noncontiguous in the primary sequences. These results suggest that PPiClust can discover not only statistically significant, but also biologically significant,
An HV%2DSVM Classifier to Infer TF%2DTF Interactions Using Protein Domains and GO Annotations.



Labeling network motifs in protein interactomes for protein function prediction.

Learning to Identify Unexpected Instances in the Test Set.

Generic Probability Density Function Reconstruction for Randomization in Privacy%2DPreserving Data Mining.

Systematic Gene Function Prediction Using a Fuzzy Nearest%2DCluster Method on Gene Expression Data.

Privacy%2DPreserving Sharing of Horizontally%2DDistributed Private Data for Constructing Accurate Classifiers.

Systematic Gene Function Prediction Using a Fuzzy Nearest%2DCluster Method on Gene Expression Data.

NeMoFinder dissecting genome%2Dwide protein%2Dprotein interactions with meso%2Dscale network motifs.

Intelligent Extraction Versus Advanced Query Recognize Transcription Factors from Databases.

A Faster and More Space%2DEfficient Algorithm for Inferring Arc%2DAnnotations of RNA Sequences through Alignment.

A correlated motif approach for finding short linear motifs from protein interaction networks.

Systematic gene function prediction from gene expression data by using a fuzzy nearest%2Dcluster method.

Increasing confidence of protein interactomes using network topological metrics.

BioContrasts extracting and exploiting protein%2Dprotein contrastive relations from biomedical literature.



Improving domain%2Dbased protein interaction prediction using biologically%2Dsignificant negative dataset.

Reconfigurable Context%2DSensitive Bio%2DBridge Middleware for Smart Bio%2DLaboratories.

Virtual Lab Dashboard Ubiquitous Monitoring and Control in a Smart Bio%2Dlaboratory.

Toward discovering disease%2Dspecific gene networks from online literature.

Virtual Lab Dashboard Ubiquitous Monitoring and Control in a Smart Bio%2Dlaboratory.

Protein Interaction Prediction Using Inferred Domain Interactions and Biologically%2DSignificant Negative Dataset.

Smart bio%2Dlaboratories of the future.

Discovering reliable protein interactions from high%2Dthroughput experimental data using network topology.

Whole%2DGenome Functional Classification of Genes by Latent Semantic Analysis on Microarray Data.



Systematic Assessment of High%2DThroughput Experimental Data for Reliable Protein Interactions Using Network Topology.

Discovery of Binding Motif Pairs from Protein Complex Structural Data and Protein Interaction Sequence Data.

A Faster and More Space%2DEfficient Algorithm for Inferring Arc%2DAnnotations of RNA Sequences Through Alignment.

Accomplishments and Challenges in Bioinformatics.

Discovering Protein%2Dprotein Interactions.

ADVICE Automated Detection and Validation of Interaction by Co%2DEvolution.
ADVICE (Automated Detection and Validation of Interaction by Co-Evolution) is a web tool for predicting and validating protein-protein interactions using the observed co-evolution between interacting proteins. Interacting proteins are known to share similar evolutionary histories since they undergo coordinated evolutionary changes to preserve interactions and functionalities. The web tool automates a commonly adopted methodology to quantify the similarities in proteins ’ evolutionary histories for postulating potential protein–protein interactions. ADVICE can also be used to validate experimental data against spurious protein interactions by identifying those that have few similarities in their evolutionary histories. The web tool accepts a list of protein sequences or sequence pairs as input and retrieves orthologous sequences to compute the similarities in the proteins ’ evolutionary histories. To facilitate hypothesis generation, detected co-evolved proteins can be visualized as a network at the website. ADVICE is available at
InterWeaver interaction reports for discovering potential protein interaction partners with online evidence.

From Informatics to Bioinformatics.
Informatics has helped in launching molecular biology into the genomic era. It appears certain that informatics will continue to be a major factor in the success of molecular biology in the post-genome era. In this paper, we describe advances made in data integration and data mining technologies that are relevant to molecular biology and biomedical sciences. In particular, we discuss some past and present research results on topics such as (a) the taming of autonomous heterogeneous distributed data sources, (b) the prediction of immunogenic peptides, (c) the discovery of gene structure features, (d) the classification of gene expression profiles, and (e) the extraction of protein interaction information from literature. Keywords: Bioinformatics, data integration, data warehousing, Kleisli, epitope prediction, FIMM, transcription start site recognition, Dragon, gene expression analysis, PCL, protein interaction extraction, PIES.
Bioinformatics Adventures in Database Research.
Informatics has helped launch molecular biology into the genomic  era. It appears certain that informatics will remain a major contributor to molecular  biology in the post-genome era. We discuss here data integration and datamining  in bioinformatics, as well as the role that database theory played in these topics.
Discovery of significant rules for classifying cancer diagnosis data.

Bioinformatics Adventures in Database Research.
Informatics has helped launch molecular biology into the genomic  era. It appears certain that informatics will remain a major contributor to molecular  biology in the post-genome era. We discuss here data integration and datamining  in bioinformatics, as well as the role that database theory played in these topics.
Integrative Approach for Computationally Inferring Protein Domain Interactions.
Motivation: The current need for high-throughput protein interaction detection has resulted in interaction data being generated en masse, using experimental methods such as yeasttwo-hybrids and protein chips. Such data can be errorful and they often do not provide adequate functional information for the detected interactions; it is therefore useful to develop an in silico approach to further validate and annotate the detected protein interactions. Results: Given that protein-protein interactions involve physical interactions between protein domains, domain-domain interaction information can be useful for validating, annotating, and even predicting protein interactions. However, large-scale experimentally determined domain-domain interaction data do not exist; as such, we describe an integrative approach to computationally derive putative domain interactions from multiple data sources, including rosetta stone sequences, protein interactions, and protein complexes. We show the usefulness of such an integrative approach by applying the derived domain interactions to predict and validate protein-protein interactions. Contact:
Integrative Approach for Computationally Inferring Protein Domain Interactions.
Motivation: The current need for high-throughput protein interaction detection has resulted in interaction data being generated en masse, using experimental methods such as yeasttwo-hybrids and protein chips. Such data can be errorful and they often do not provide adequate functional information for the detected interactions; it is therefore useful to develop an in silico approach to further validate and annotate the detected protein interactions. Results: Given that protein-protein interactions involve physical interactions between protein domains, domain-domain interaction information can be useful for validating, annotating, and even predicting protein interactions. However, large-scale experimentally determined domain-domain interaction data do not exist; as such, we describe an integrative approach to computationally derive putative domain interactions from multiple data sources, including rosetta stone sequences, protein interactions, and protein complexes. We show the usefulness of such an integrative approach by applying the derived domain interactions to predict and validate protein-protein interactions. Contact:
InterDom a database of putative interacting protein domains for validating predicted protein interactions and complexes.

Sorting Permutations by Reversals Through Branch%2Dand%2DPrice.
We describe an exact algorithm for the problem of sorting a permutation by the minimum number of reversals, originating from evolutionary studies in molecular biology. Our approach is based on an integer linear programming formulation of a graph-theoretic relaxation of the problem, calling for a decomposition of the edge set of a bicolored graph into the maximum number of alternating cycles. The formulation has one variable for each alternating cycle, and the associated linear programming relaxation is solved by column generation. A major advantage with respect to previous approaches is that the subproblem to face in the column generation phase requires no longer the solution of min-cost general matching problems, but of min-cost bipartite matching problems. Experiments show that there is a tremendous speed-up in going from general matching to bipartite matching, although the best-known algorithms for the two problems have the same theoretical worst-case complexity. We also...
Fast practical solution of sorting by reversals.
We deal with the practical solution of the problem of Sorting a permutation By Reversals (SBR), which has relevant applications in computational biology. We present a successful approach based on the use of Linear Programming (LP). In particular, we deal with an LP relaxation with exponentially many variables, that can be handled by generating variables &#034;on the fly&#034;, according to a so-called column generation scheme. A major advantage with respect to previous analogous approaches is that the subproblem to face in the column generation phase requires no longer the solution of min-cost general matching problems, but the solution of min-cost bipartite matching problems. Experiments show that, at least for our purposes, there is a tremendous speed-up in going from general matching to bipartite matching, although the best-known algorithms for the two problems have the same theoretical worst-case complexity. We also prove the worst-case ratio between the lower bound value obtained b...
